Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach
نویسندگان
چکیده
منابع مشابه
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach
Tavenas has recently proved that any nO(1)-variate and degree n polynomial in VP can be computed by a depth-4 ΣΠ[O( p n)]ΣΠ[ p n] circuit of size 2O( p n log n) [Tav13]. So to prove VP 6= VNP, it is sufficient to show that an explicit polynomial ∈ VNP of degree n requires 2ω( p n log n) size depth-4 circuits. Soon after Tavenas’s result, for two different explicit polynomials, depth-4 circuit s...
متن کاملSuperpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree n in n variables such that any homogeneous depth 4 arithmetic circuit computing it must have size n . Our results extend the works of Nisan-Wigderson [NW95] (which showed superpolynomial lower bounds for homogeneous depth 3 circuits), Gup...
متن کاملA lower bound for the determinantal complexity of a hypersurface
We prove that the determinantal complexity of a hypersurface of degree d > 2 is bounded below by one more than the codimension of the singular locus, provided that this codimension is at least 5. As a result, we obtain that the determinantal complexity of the 3×3 permanent is 7. We also prove that for n > 3, there is no nonsingular hypersurface in Pn of degree d that has an expression as a dete...
متن کاملLower Bounds on Communication Complexity ∗
A notion of ”communication complexity” is used to formally measure the degree to which a Boolean function is ”global”. An explicit combinatorial lower bound for this complexity measure is presented. In particular, this leads to an exp(Ω( √ n)) lower bound on the complexity of depth-restricted contact schemes computing some natural Boolean functions in NP.
متن کاملLower Bounds in Communication Complexity
The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to determine the value f(x, y). Communication complexity is a fundamental measure of complexity of functions. Lower bounds on this measure lead to lower bounds on many other measures of computational complexity. This monograph survey lower bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: computational complexity
سال: 2019
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s00037-019-00185-4